Reinforced Neighborhood Selection Guided Multi-Relational Graph Neural Networks
نویسندگان
چکیده
Graph Neural Networks (GNNs) have been widely used for the representation learning of various structured graph data, typically through message passing among nodes by aggregating their neighborhood information via different operations. While promising, most existing GNNs oversimplify complexity and diversity edges in thus are inefficient to cope with ubiquitous heterogeneous graphs, which form multi-relational representations. In this article, we propose RioGNN , a novel Reinforced, recursive, flexible selection guided Network architecture, navigate neural network structures whilst maintaining relation-dependent We first construct graph, according practical task, reflect heterogeneity nodes, edges, attributes, labels. To avoid embedding over-assimilation types employ label-aware similarity measure ascertain similar neighbors based on node attributes. A reinforced relation-aware neighbor mechanism is developed choose targeting within relation before all from relations obtain eventual embedding. Particularly, improve efficiency selecting, new recursive scalable reinforcement framework estimable depth width scales graphs. can learn more discriminative enhanced explainability due recognition individual importance each filtering threshold mechanism. Comprehensive experiments real-world data tasks demonstrate advancements effectiveness, efficiency, model explainability, as opposed other comparative GNN models.
منابع مشابه
Adaptive Neighborhood Graph Construction for Inference in Multi-Relational Networks
A neighborhood graph, which represents the instances as vertices and their relations as weighted edges, is the basis of many semi-supervised and relational models for node labeling and link prediction. Most methods employ a sequential process to construct the neighborhood graph. This process often consists of generating a candidate graph, pruning the candidate graph to make a neighborhood graph...
متن کاملNeural Networks in Multi-Relational Data Mining
Neural networks are non-parametric, robust, and exhibit good learning and generalization capabilities in data-rich environments. Multi-relational data mining framework is based on the search for interesting patterns in the relational database. Multi-relational data mining algorithms search a large hypothesis space in order to find a suitable model for a given data set. Although neural networks ...
متن کاملEdge Attention-based Multi-Relational Graph Convolutional Networks
Graph convolutional network (GCN) is generalization of convolutional neural network (CNN) to work with arbitrarily structured graphs. A binary adjacency matrix is commonly used in training a GCN. Recently, the attention mechanism allows the network to learn a dynamic and adaptive aggregation of the neighborhood. We propose a new GCN model on the graphs where edges are characterized in multiple ...
متن کاملAggregation versus selection bias, and relational neural networks
Current relational learners handle sets either by aggregating over them or by selecting specific elements, but do not combine both. This imposes a significant, possibly undesirable bias on these learners. We discuss this bias, as well as some ideas on how to lift it. In the process, we introduce the notion of relational neural networks. 1 Biases of Relational Learners Among the many approaches ...
متن کاملMulti-Neighborhood Convolutional Networks
We explore the role of scale for improved feature learning in convolutional networks. We propose multi-neighborhood convolutional networks, designed to learn image features at different levels of detail. Utilizing nonlinear scale-space models, the proposed multineighborhood model can effectively capture fine-scale image characteristics (i.e., appearance) using a small-size neighborhood, while c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Information Systems
سال: 2021
ISSN: ['1558-1152', '1558-2868', '1046-8188', '0734-2047']
DOI: https://doi.org/10.1145/3490181